Multilayer Perceptron optimization through Simulated Annealing and Fast Simulated Annealing
نویسندگان
چکیده
منابع مشابه
Group Session Key Exchange Multilayer Perceptron Based Simulated Annealing
In this paper, a group session Key Exchange multilayer Perceptron based Simulated Annealing guided Automata and Comparison based Metamorphosed encryption technique (GSMLPSA) has been proposed in wireless communication of data/information. Both sender and receiver uses identical multilayer perceptron and depending on the final output of the both side multilayer perceptron, weights vector of hidd...
متن کاملFast Simulated Re - Annealing
An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...
متن کاملOptimization by simulated annealing.
There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...
متن کاملSimulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملGlobal optimization and simulated annealing
In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of N" in which some real valued function f assumes its optimal (maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as orig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Academic Journal on Computing, Engineering and Applied Mathematics
سال: 2020
ISSN: 2675-3588
DOI: 10.20873/ajceam.v1i2.9474